Band Matrix Representation of Triangular InputBalanced

نویسنده

  • Andrew P. Mullhaupt
چکیده

For generic lower triangular matrices, A, we prove that A ij = P d q=1 H iq G jq for i > j is equivalent to A = M ?1 N where M and N are d+1 banded matrices. A lower triangular matrix A is input balanced of order/rank d if there exists a rank-d matrix B such that AA = I ? BB. We prove that if A is triangular input balanced then generically, A = M ?1 N where M and N are d + 1 banded matrices. This also implies A i;j = P d q=1 H iq G jq for i > j. When B is a vector, explict representations are given and the eigendecomposition is evaluated.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the fine spectrum of generalized upper triangular double-band matrices $Delta^{uv}$ over the sequence spaces $c_o$ and $c$

The main purpose of this paper is to determine the fine spectrum of the generalized upper triangular double-band matrices uv over the sequence spaces c0 and c. These results are more general than the spectrum of upper triangular double-band matrices of Karakaya and Altun[V. Karakaya, M. Altun, Fine spectra of upper triangular doubleband matrices, Journal of Computational and Applied Mathematics...

متن کامل

Riordan group approaches in matrix factorizations

In this paper, we consider an arbitrary binary polynomial sequence {A_n} and then give a lower triangular matrix representation of this sequence. As main result, we obtain a factorization of the innite generalized Pascal matrix in terms of this new matrix, using a Riordan group approach. Further some interesting results and applications are derived.

متن کامل

Numerical Solution of Second Kind Volterra and Fredholm Integral Equations Based on a Direct Method Via Triangular Functions

A numerical method for solving linear integral equations of the second kind is formulated. Based on a special representation of vector forms of triangular functions and the related operational matrix of integration, the integral equation reduces to a linear system of algebraic equations. Generation of this system needs no integration, so all calculations can easily be implemented. Numerical res...

متن کامل

A Fast and Accurate Expansion-Iterative Method for Solving Second Kind Volterra Integral Equations

This article proposes a fast and accurate expansion-iterative method for solving second kind linear Volterra integral equations. The method is based on a special representation of vector forms of triangular functions (TFs) and their operational matrix of integration. By using this approach, solving the integral equation reduces to solve a recurrence relation. The approximate solution of integra...

متن کامل

An Efficient Numerical Algorithm For Solving Linear Differential Equations of Arbitrary Order And Coefficients

Referring to one of the recent works of the authors, presented in~cite{differentialbpf}, for numerical solution of linear differential equations, an alternative scheme is proposed in this article to considerably improve the accuracy and efficiency. For this purpose, triangular functions as a set of orthogonal functions are used. By using a special representation of the vector forms of triangula...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007